package branch_and_price;

public class Label {

    private int id;
    private Data data;
    private double c; // label reduced cost
    private long NI; // nodes points that have passed（标记这个点是否已经被访问了）
    private Label father; // 通过父节点，可以串起来一个链表

    public Label(Data d){
        data = d;
        NI =0X00;
    }

    public int getId() {
        return id;
    }

    public void setId(int id) {
        this.id = id;
    }

    public double getC() {
        return c;
    }

    public void setC(double c) {
        this.c = c;
    }

    public long getNI() {
        return NI;
    }

    public void setNI(long NI) {
        this.NI = NI;
    }

    public void setFather(Label father) {
        this.father = father;
    }

    public Label getFather() {
        return father;
    }
}